Numerical Polynomial Algebra: Concepts and Algorithms
نویسنده
چکیده
In this expository lecture, we explain how problems of classical polynomial algebra may be understood and numerically solved when they appear in the context of Scientific Computing, i.e. with data of limited accuracy. A suitable conceptual framework is introduced and its use explained in a number of situations.
منابع مشابه
Numerical solution of a system of fuzzy polynomial equations by modified Adomian decomposition method
In this paper, we present some efficient numerical algorithm for solving system of fuzzy polynomial equations based on Newton's method. The modified Adomian decomposition method is applied to construct the numerical algorithms. Some numerical illustrations are given to show the efficiency of algorithms.
متن کاملPrimal-dual path-following algorithms for circular programming
Circular programming problems are a new class of convex optimization problems that include second-order cone programming problems as a special case. Alizadeh and Goldfarb [Math. Program. Ser. A 95 (2003) 3-51] introduced primal-dual path-following algorithms for solving second-order cone programming problems. In this paper, we generalize their work by using the machinery of Euclidean Jordan alg...
متن کاملAlgebraic Moments – Real Root Finding and Related Topics –
Polynomial root finding is a classical and well studied problem in mathematics with practical applications in many areas. Various relevant questions can be reformulated into the task of finding all common roots of a given system of polynomials in several variables, the so-called algebraic variety or zero set. Traditionally, root finding algorithms are implemented in exact arithmetics over algeb...
متن کاملOn the application of different numerical methods
Four different algorithms are designed to obtain the null-space of a polynomial matrix. In this first part we present two algorithms. These algorithms are based on classical methods of numerical linear algebra, namely the reduction into the column echelon form and the LQ factorization. Both algorithms take advantage of the block Toeplitz structure of the Sylvester matrix associated with the pol...
متن کاملOn the application of different
Motivated by some control problems requiring the extraction of the null-space of large polynomial matrices, we introduce two fast numerical linear algebra algorithms to perform this task. These fast algorithms are based on the displacement structure theory and the generalized Schur algorithm. We present a full analysis of the performance of both algorithms and a comparison with the performance ...
متن کامل